Parallel Time and Quantifier Prefixes
نویسندگان
چکیده
منابع مشابه
Time and the Event: the Semantics of Russian Prefixes
The vast majority of prefixed roots fall into the perfective class, although there are some perfectives that are not prefixed. Imperfective verb forms are either unprefixed altogether, or possess a suffixal marker of imperfectivity (generally called the ‘secondary’ imperfective). The analytical problem is this: despite this apparently uniform effect on the interpretation of the tense morphology...
متن کاملComplete Finite Prefixes of Symbolic Unfoldings of Time Petri Nets
Monitoring real-time concurrent systems is a challenging task. In this paper we formulate (model-based) supervision by means of hidden state history reconstruction, from event (e.g. alarm) observations. We follow a so-called true concurrency approach using time Petri nets: the model defines explicitly the causal and concurrency relations between the observable events, produced by the system und...
متن کاملPalindromic Prefixes and Diophantine Approximation
This text is devoted to simultaneous approximation to ξ and ξ by rational numbers with the same denominator, where ξ is an irrational non-quadratic real number. We focus on an exponent β0(ξ) that measures the regularity of the sequence of all exceptionally precise such approximants. We prove that β0(ξ) takes the same set of values as a combinatorial quantity that measures the abundance of palin...
متن کاملPalindrome Prefixes and Diophantine Approximation
This text is devoted to simultaneous approximation to ξ and ξ by rational numbers with the same denominator, where ξ is a non-quadratic real number. We focus on an exponent β0(ξ) that measures the quality of such approximations (when they are exceptionally good). We prove that β0(ξ) takes the same set of values as a combinatorial quantity that measures the abundance of palindrome prefixes in an...
متن کاملPalindrome Prefixes and Episturmian Words
Let w be an infinite word on an alphabet A. We denote by (ni)i≥1 the increasing sequence (assumed to be infinite) of all lengths of palindrome prefixes of w. In this text, we give an explicit construction of all words w such that ni+1 ≤ 2ni + 1 for all i, and study these words. Special examples include characteristic Sturmian words, and more generally standard episturmian words. As an applicati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2009
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-009-0264-6